Dense stereo using pivoted dynamic programming
نویسندگان
چکیده
منابع مشابه
Dense stereo using pivoted dynamic programming
This paper describes an improvement to the dynamic programming approach for dense stereo. Traditionally dense stereo algorithms proceed independently for each pair of epipolar lines, and then a further step is used to smooth the estimated disparities between the epipolar lines. This typically results in a streaky disparity map along depth discontinuities. In order to overcome this problem the i...
متن کاملBased Dense Stereo Matching using Dynamic Programming and Color
This paper presents a new feature based dense stereo matching algorithm to obtain the dense disparity map via dynamic programming. After extraction of some proper features, we use some matching constraints such as epipolar line, disparity limit, ordering and limit of directional derivative of disparity as well. Also, a coarseto-fine multiresolution strategy is used to decrease the search space ...
متن کاملFeature Based Dense Stereo Matching using Dynamic Programming and Color
This paper presents a new feature based dense stereo matching algorithm to obtain the dense disparity map via dynamic programming. After extraction of some proper features, we use some matching constraints such as epipolar line, disparity limit, ordering and limit of directional derivative of disparity as well. Also, a coarseto-fine multiresolution strategy is used to decrease the search space ...
متن کاملRealtime Dense Stereo Matching with Dynamic Programming in CUDA
Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability prope...
متن کاملA Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers have already proposed several grid-based algorithms for fully utilizing information embodied in both intraand inter-epipolar lines. Though their performances are greatly improved, they are very time-consuming. The new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image and Vision Computing
سال: 2004
ISSN: 0262-8856
DOI: 10.1016/j.imavis.2004.02.012